Mathematical Formulation of Energy Minimization – Based Inverse Optimization

نویسنده

  • Ivaylo B. Mihaylov
چکیده

PURPOSE To introduce the concept of energy minimization-based inverse optimization for external beam radiotherapy. MATERIALS AND METHODS Mathematical formulation of energy minimization-based inverse optimization is presented. This mathematical representation is compared to the most commonly used dose-volume based formulation used in inverse optimization. A simple example on digitally created phantom is demonstrated. The phantom consists of three sections: a target surrounded by high and low density regions. The target is irradiated with two beams passing through those regions. Inverse optimization with dose-volume and energy minimization-based objective functions is performed. The dosimetric properties of the two optimization results are evaluated. RESULTS Dose-volume histograms for all the volumes of interest used for dose optimization are compared. Energy-based optimization results in higher maximum dose to the volumes that are used as dose-limiting structures. However, the average and the integral doses delivered for the volumes outside of the target are larger with dose-volume optimization. CONCLUSION Mathematical formulation of energy minimization-based inverse optimization is derived. The optimization applied on the digital phantom shows that energy minimization-based approach tends to deliver somewhat higher maximum doses compared to standard of care, realized with dose-volume based optimization. At the same time, however, the energy minimization-based optimization reduces much more significantly the average and the integral doses.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the duality of quadratic minimization problems using pseudo inverses

‎In this paper we consider the minimization of a positive semidefinite quadratic form‎, ‎having a singular corresponding matrix $H$‎. ‎We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method‎. ‎Given this approach and based on t...

متن کامل

Optimization of Robotic Arm Trajectory Using Genetic Algorithm

The paper presents a genetic algorithm based design approach of the robotic arm trajectory control with the optimization of various criterions. The described methodology is based on the inverse kinematics problem and it additionally considers the minimization of the operating-time, and/or the minimization of energy consumption as well as the minimization of the sum of all rotation changes durin...

متن کامل

A new stereo formulation not using pixel and disparity models

We introduce a new stereo formulation which does not use pixel and disparity models. Many problems in vision are treated as assigning each pixel a label. Disparities are labels for stereo. Such pixel-labeling problems are naturally represented in terms of energy minimization, where the energy function has two terms: one term penalizes solutions that inconsistent with the observed data, the othe...

متن کامل

Sensitivity computation of the 1 minimization problem and its application to dictionary design of ill-posed problems

The 1 minimization problem has been studied extensively in the past few years. Recently, there has been a growing interest in its application for inverse problems. Most studies have concentrated in devising ways for sparse representation of a solution using a given prototype dictionary. Very few studies have addressed the more challenging problem of optimal dictionary construction, and even the...

متن کامل

SDO relaxation approach to fractional quadratic minimization with one quadratic constraint

In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2014